Path-planning techniques for the simulation of disassembly tasks

نویسندگان

  • Iker Aguinaga
  • Luis Matey
چکیده

Purpose – This paper aims to develop path-planning techniques that support a general selective disassembly planner in a virtual reality environment. Design/methodology/approach – The paper presents an automatic selective disassembly planning and two path-planning techniques that support it. The first one is based on single translations, while the second is based on the generation of a random search tree. The methods used have been adapted and modified from available robotic path-planning methods for their use in disassembly path planning. Findings – The paper finds that the proposed techniques are applicable to the automatic generation of disassembly sequences. Research limitations/implications – The paper provides an automatic tool that can be integrated in simulation software for the analysis and validation of disassembly operation. Practical implications – Maintenance operations have a great impact in the security and life expectancy of any product. This is especially true for some applications such as aerospace that must pass rigorous security checking procedures. Geometric reasoning and virtual reality can help in reducing costs and design time by moving testing from physical mock-ups to virtual ones. Originality/value – The paper shows the integration of path-planning techniques in automatic disassembly-planning methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Disassembly Path Planning for Objects with Articulated Parts

Sampling-based path planning algorithms are powerful tools for computing disassembly motions. This paper presents a variant of the RRT algorithm particularly devised for the disassembly of objects with articulated parts. Configuration parameters generally play two different roles in this type of problems: some of them are essential for the disassembly task, while others only need to move if the...

متن کامل

D-Plan: Efficient Collision-Free Path Computation for Part Removal and Disassembly

We present a novel approach to compute a collision-free path for part disassembly simulation and virtual prototyping of part removal. Our algorithm is based on sample-based motion planning that connects collision-free samples in the configuration space using local planning. In order to effectively handle the tight-fitting scenarios, we describe techniques to generate samples in narrow passages ...

متن کامل

Study of Evolutionary and Swarm Intelligent Techniques for Soccer Robot Path Planning

Finding an optimal path for a robot in a soccer field involves different parameters such as the positions of the robot, positions of the obstacles, etc. Due to simplicity and smoothness of Ferguson Spline, it has been employed for path planning between arbitrary points on the field in many research teams. In order to optimize the parameters of Ferguson Spline some evolutionary or intelligent al...

متن کامل

Viewing Motion Planning as Disassembly: A Decomposition-Based Approach for Non-Stationary Robots

An efficient single-query motion planning approach for non-stationary robots is presented. The approach exploits workspace information to identify highly constrained placements of the robot along a potential solution path. Due to the constraints imposed by the environment at these placements, we view them as an assembly, consisting of the robot and the environment. The original motion planning ...

متن کامل

Formation Control and Path Planning of Two Robots for Tracking a Moving Target

This paper addresses the dynamic path planning for two mobile robots in unknownenvironment with obstacle avoidance and moving target tracking. These robots must form atriangle with moving target. The algorithm is composed of two parts. The first part of thealgorithm used for formation planning of the robots and a moving target. It generates thedesired position for the robots for the next step. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007